Fluent Merging: A General Technique to Improve Reachability Heuristics and Factored Planning
نویسندگان
چکیده
Fluent merging is the process of combining two or more fluents (state variables) into a single “super” fluent. By compiling in some of the inter-fluent interactions, fluent merging can (1) help improve informedness of relaxed reachability heuristics, and (2) improve the efficiency of factored planning as it removes some of the intervariable dependencies. Although some special cases of fluent merging have been around (under other names), the technique in its full generality has not been exploited or analyzed. In this paper, we discuss the general motivations for and tradeoffs in fluent merging. We will argue that existing techniques are too conservative in identifying mergeable fluents. We will then provide some novel techniques based on causal graph analysis for identifying mergeable fluents.
منابع مشابه
Model Minimization, Regression, and Propositional STRIPS Planning
Propositional STRIPS planning problems can be viewed as finite state automata (FSAs) represented in a factored form. Automaton minimizat ion is a well-known technique for reducing the size of an explicit FSA. Recent work in computer-aided verification on model checking has extended this technique to provide automaton minimizat ion algorithms for factored FSAs. In this paper, we consider the rel...
متن کاملDIRECTED UNFOLDING Reachability Analysis of Concurrent Systems & Applications to Automated Planning
The factored state representation and concurrency semantics of Petri nets are closely related to those of classical planning models, yet automated planning and Petri net analysis have developed independently, with minimal and mainly unconvincing attempts at crossfertilisation. This thesis exploits the relationship between the formal reachability problem, and the automated planning problem, via ...
متن کاملFluent Merging for Classical Planning Problems
Fluent merging is a reformulation technique for classical planning problems that can be applied automatically or semiautomatically. The reformulation strives to transform a planning task into a representation that allows a planning algorithm to find solutions more efficiently or to find solutions of better quality. This work introduces different approaches for fluent merging and evaluates them ...
متن کاملReversed Planning Graphs for Relevance Heuristics in AI Planning
Most AI planning heuristics are reachability heuristics, in the sense that they estimate the minimum plan length from the initial state to a search state. Such heuristics are best suited for use in regression state-space planners, since a progression planner would have to reconstruct the heuristic function at each new search state. However, some domains (or problem instances within a certain do...
متن کاملPlanning via Petri Net Unfolding
The factored state representation and concurrency semantics of Petri nets are closely related to those of concurrent planning domains, yet planning and Petri net analysis have developed independently, with minimal and usually unconvincing attempts at cross-fertilisation. In this paper, we investigate and exploit the relationship between the two areas, focusing on Petri net unfolding, which is a...
متن کامل